package binarySearch;

//https://leetcode.cn/problems/peak-index-in-a-mountain-array/
public class l_852 {
    public int peakIndexInMountainArray(int[] arr) {
        int left = 0, right = arr.length - 1;
        //根据if条件两种二分查找做法都可以通过
        while(left < right)
        {
            int mid = left + (right - left + 1) / 2;
            if(arr[mid] > arr[mid - 1]) left = mid;
            else right = mid - 1;
        }
        return left;
    }
}
